The Search for Computational Intelligence
نویسندگان
چکیده
We define and explore in simulation several rules for the local evolution of generative rules for 1D and 2D cellular automata. Our implementation uses strategies from conceptual blending. We discuss potential applications to modelling social dynamics.
منابع مشابه
Winner Determination in Combinatorial Auctions using Hybrid Ant Colony Optimization and Multi-Neighborhood Local Search
A combinatorial auction is an auction where the bidders have the choice to bid on bundles of items. The WDP in combinatorial auctions is the problem of finding winning bids that maximize the auctioneer’s revenue under the constraint that each item can be allocated to at most one bidder. The WDP is known as an NP-hard problem with practical applications like electronic commerce, production manag...
متن کاملOptimizing Cost Function in Imperialist Competitive Algorithm for Path Coverage Problem in Software Testing
Search-based optimization methods have been used for software engineering activities such as software testing. In the field of software testing, search-based test data generation refers to application of meta-heuristic optimization methods to generate test data that cover the code space of a program. Automatic test data generation that can cover all the paths of software is known as a major cha...
متن کاملA hybrid computational intelligence model for foreign exchange rate forecasting
Computational intelligence approaches have gradually established themselves as a popular tool for forecasting the complicated financial markets. Forecasting accuracy is one of the most important features of forecasting models; hence, never has research directed at improving upon the effectiveness of time series models stopped. Nowadays, despite the numerous time series forecasting models propos...
متن کاملA Combined Metaheuristic Algorithm for the Vehicle Routing Problem and its Open Version
Abstract: The Open Vehicle Routing Problem (OVRP) is one of the most important extensions of the vehicle routing problem (VRP) that has many applications in industrial and service. In the VRP, a set of customers with a specified demand of goods are given and a depot where a fleet of identical capacitated vehicles is located. We are also given the ‘‘traveling costs’’ between the depot and all th...
متن کاملTabu Search With Target Analysis To The Assembly Line Balancing Problems -- An Artificial Intelligence Approach
This paper describes the application of tabu search, a recent heuristic technique for combinatorial optimization problems, to the assembly line balancing problems. Computational experiments with different search strategies have been performed for some assembly ine problems from literature. Computational results show that except for few cases tabu search always finds optimal solutions.
متن کاملQuantum Computing (Recent Developments in Quantum Computational Intelligence)
This paper surveys the recent trends in quantum computational intelligence. Initially we focus on Grover’s search algorithm and its extensions. Next we summarize the current research aimed at applying the search algorithm to create quantum Artificial Neural Networks and look at methods of improving the performance of our newly created quantum neural networks.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1502.00130 شماره
صفحات -
تاریخ انتشار 2015